Problems on Finite Automata and the Exponential Time Hypothesis
نویسندگان
چکیده
منابع مشابه
Problems on Finite Automata and the Exponential Time Hypothesis
We study several classical decision problems on finite automata under the (Strong) Exponential Time Hypothesis. We focus on three types of problems: universality, equivalence, and emptiness of intersection. All these problems are known to be CoNP-hard for nondeterministic finite automata, even when restricted to unary input alphabets. A different type of problems on finite automata relates to a...
متن کاملRestricted Constraint Satisfaction Problems and the Exponential-time Hypothesis
A constraint satisfaction problem (CSP) can be represented as two structures: the structure induced by the variables and the structure induced by the constraint language. Both these parameters are amenable to restrictions which a ects the complexity of the resulting problems. In this thesis we shall use both constraint language restrictions and structural restrictions in order to create problem...
متن کاملRelating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis
Obtaining lower bounds for NP-hard problems has for a long time been an active area of research. Recent algebraic techniques introduced by Jonsson et al. (SODA 2013) show that the time complexity of the parameterized SAT(·) problem correlates to the lattice of strong partial clones. With this ordering they isolated a relation R such that SAT(R) can be solved at least as fast as any other NP-har...
متن کاملHardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis
Algorithmic research strives to develop fast algorithms for fundamental problems. Despite its many successes, however, many problems still do not have very efficient algorithms. For years researchers have explained the hardness for key problems by proving NP-hardness, utilizing polynomial time reductions to base the hardness of key problems on the famous conjecture P 6= NP. For problems that al...
متن کاملLecture 17 : The Strong Exponential Time Hypothesis
For SAT and CIRCUIT -SAT there is an obvious brute force algorithm that requires 2m time where n is the number of variables and m is a measure of the overall input size. How much better we can seems to depend on the input structure. In the case of kSAT there are some improvements. Theorem 1.1 (Paturi-Pudlak,Schöning,Paturi-Pudlak-Saks-Zane,Hertli). For constants 1 ≤ c ≤ 2, there are (randomized...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2017
ISSN: 1999-4893
DOI: 10.3390/a10010024